Splice Graphs and their Vertex-Degree-Based Invariants

نویسندگان

چکیده مقاله:

Let G_1 and G_2 be simple connected graphs with disjoint vertex sets V(G_1) and V(G_2), respectively. For given vertices a_1in V(G_1) and a_2in V(G_2), a splice of G_1 and G_2 by vertices a_1 and a_2 is defined by identifying the vertices a_1 and a_2 in the union of G_1 and G_2. In this paper, we present exact formulas for computing some vertex-degree-based graph invariants of splice of graphs.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

splice graphs and their vertex-degree-based invariants

let g_1 and g_2 be simple connected graphs with disjoint vertex sets v(g_1) and v(g_2), respectively. for given vertices a_1in v(g_1) and a_2in v(g_2), a splice of g_1 and g_2 by vertices a_1 and a_2 is defined by identifying the vertices a_1 and a_2 in the :union: of g_1 and g_2. in this paper, we present exact formulas for computing some vertex-degree-based graph invariants of splice of graphs.

متن کامل

On discriminativity of vertex-degree-based indices

A recently published paper [T. Došlić, this journal 3 (2012) 25-34] considers the Zagreb indices of benzenoid systems, and points out their low discriminativity. We show that analogous results hold for a variety of vertex-degree-based molecular structure descriptors that are being studied in contemporary mathematical chemistry. We also show that these results are straightforwardly obtained by u...

متن کامل

Four-Vertex Degree Graphs of Nonsolvable Groups

For a finite group G, the character degree graph ∆(G) is the graph whose vertices are the primes dividing the degrees of the ordinary irreducible characters of G, with distinct primes p and q joined by an edge if pq divides some character degree of G. We determine all graphs with four vertices that occur as ∆(G) for some nonsolvable group G. Along with previously known results on character degr...

متن کامل

Distribution of Vertex Degree in Web-Graphs

We give results for the age dependent distribution of vertex degree and number of vertices of given degree in the undirected web-graph process, a discrete random graph process introduced in [8]. For such processes we show that as k → ∞, the expected proportion of vertices of degree k has power law parameter 1+1/η where η is the limiting ratio of the expected number of edge endpoints inserted by...

متن کامل

On the eigenvalues of some matrices based on vertex degree

The aim of this paper is to compute some bounds of forgotten index and then we present spectral properties of this index. In continuing, we define a new version of energy namely ISI energy corresponded to the ISI index and then we determine some bounds for it.

متن کامل

Constructing vertex decomposable graphs

‎Recently‎, ‎some techniques such as adding whiskers and attaching graphs to vertices of a given graph‎, ‎have been proposed for constructing a new vertex decomposable graph‎. ‎In this paper‎, ‎we present a new method for constructing vertex decomposable graphs‎. ‎Then we use this construction to generalize the result due to Cook and Nagel‎.

متن کامل

منابع من

با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ذخیره در منابع من قبلا به منابع من ذحیره شده

{@ msg_add @}


عنوان ژورنال

دوره 8  شماره 1

صفحات  61- 70

تاریخ انتشار 2017-03-01

با دنبال کردن یک ژورنال هنگامی که شماره جدید این ژورنال منتشر می شود به شما از طریق ایمیل اطلاع داده می شود.

کلمات کلیدی

میزبانی شده توسط پلتفرم ابری doprax.com

copyright © 2015-2023